Stopping Rules for Linear Stochastic Approximation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stopping Stochastic Approximation

The practical application of stochastic approximation methods require a reliable means to stop the iterative process when the estimate is close to the optimal value or when further improvement of the estimate is doubtful. Conventional ideas on stopping stochastic algorithms employ probabilistic criteria based on the asymptotic distribution of the stochastic approximation process, often with the...

متن کامل

Stopping rules for box-constrained stochastic global optimization

We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second is based on the comparison of asymptotic expectation values of observable quantities to the actually measured ones. The third offers a probabilistic estimate for the number of local minima inside the search domain. Thei...

متن کامل

Finite Difference Approximation for Stochastic Optimal Stopping Problems with Delays

This paper considers the computational issue of the optimal stopping problem for the stochastic functional differential equation treated in [4]. The finite difference method developed by Barles and Souganidis [2] is used to obtain a numerical approximation for the viscosity solution of the infinite dimensional Hamilton-Jacobi-Bellman variational inequality (HJBVI) associated with the optimal st...

متن کامل

Stochastic Games of Control and Stopping for a Linear Diffusion

We study three stochastic differential games. In each game, two players control a process X = {Xt , 0 ≤ t < ∞} which takes values in the interval I = (0, 1), is absorbed at the endpoints of I, and satisfies a stochastic differential equation dXt = μ ( Xt, α(Xt), β(Xt) ) dt + σ ( Xt, α(Xt), β(Xt) ) dWt , X0 = x ∈ I . The control functions α(·) and β(·) are chosen by players A and B, respectively...

متن کامل

Stopping Rules for Turbo Decoders

Decoders for turbo codes are iterative in nature, i.e., they have to perform a certain number of iterations before reaching a satisfactory degree of confidence regarding a frame to be decoded. Until now standard turbo decoders have used a fixed number of iterations. In this article, we propose some simple “stopping rules” that can be used to reduce the average number of iterations. This techniq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers

سال: 2012

ISSN: 1342-5668,2185-811X

DOI: 10.5687/iscie.25.39